.TH std::flat_multiset::replace 3 "2024.06.10" "http://cppreference.com" "C++ Standard Libary"
.SH NAME
std::flat_multiset::replace \- std::flat_multiset::replace

.SH Synopsis
   void replace( container_type&& cont );  (since C++23)

   Replaces the underlying container c. Equivalent to: c = std::move(cont);.

   The elements of cont must be sorted with respect to compare. Otherwise, the behavior
   is undefined.

.SH Parameters

   cont - a sorted container of type KeyContainer, the contents of which will be moved
          into *this

.SH Return value

   \fI(none)\fP

.SH Complexity

   Equals to complexity of std::move applied to adapted container.

.SH Example


// Run this code

 #include <algorithm>
 #include <cassert>
 #include <flat_set>
 #include <print>
 #include <vector>

 int main()
 {
     std::vector<int> keys{1, 2, 3};
     assert(std::ranges::is_sorted(keys));

     std::flat_multiset<int> set;
     assert(set.empty());

     set.replace(keys);
     assert(set.size() == 3);
     assert(keys.empty());

     std::println("{}", set); // set.keys()
 }

.SH Output:

 [1, 2, 3]

.SH See also

   extract extracts the underlying container
           \fI(public member function)\fP
